A Polyhedral Approach to Online Bipartite Matching
نویسندگان
چکیده
We study the i.i.d. online bipartite matching problem, a dynamic version of the classical model where one side of the bipartition is fixed and known in advance, while nodes from the other side appear one at a time as i.i.d. realizations of a uniform distribution, and must immediately be matched or discarded. We consider various relaxations of the polyhedral set of achievable matching probabilities, introduce valid inequalities, and discuss when they are facet-defining. We also show how several of these relaxations correspond to ranking policies and their timedependent generalizations. We finally present a computational study of these relaxations and policies to determine their empirical performance.
منابع مشابه
A lazy approach to on-line bipartite matching
We present a new approach, called a lazy matching, to the problem of on-line matching on bipartite graphs. Originally, each arriving element is irrevocably matched with some already existing one. In this paper we allow matching a new element to a group of elements (possibly decreasing other groups) with additional restrictions that every two groups have to be disjoint and decreasing a group is ...
متن کاملOnline Bipartite Matching: A Survey and A New Problem
We study the problem of online bipartite matching, where algorithms have to draw irrevocable matchings based on an incomplete bipartite graph. Specifically, we focus on algorithms that maximize number of matchings (i.e. graphs with weight 0 or 1). First, competitive ratios of a well-studied problem (only one side of the bipartite graph is incomplete) with adversarial, random order and iid model...
متن کاملCSE 525 : Randomized Algorithms and Probabilistic Analysis Lecture 6 Lecturer : Anna
Online Bipartite Matching is a generalization of a well-known Bipartite Matching problem. In a Bipartite Matching, we a given a bipartite graph G = (L,R,E), and we need to find a matching M ⊆ E such that no edges in M have common endpoints. In the online version L is known, but vertices in R are arriving one at a time. When vertex j ∈ R arrives (with all its edges), we need to make an irreversi...
متن کاملThe weighted stable matching problem
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general. Our contribution is two fold: a polyhedral characterization and an approximation algorithm. Previously Chen et al. have shown that the stab...
متن کاملAn Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
We study online variants of weighted bipartite matching on graphs and hypergraphs. In our model for online matching, the vertices on the right-hand side of a bipartite graph are given in advance and the vertices on the left-hand side arrive online in random order. Whenever a vertex arrives, its adjacent edges with the corresponding weights are revealed and the online algorithm has to decide whi...
متن کامل